Expressiveness and Model Checking of Temporal Logics
نویسنده
چکیده
Acknowledgment I would like to thank my supervisor for constant willingness to discuss, and for his comments on a draft of this PhD thesis proposal. I thank Tony Kučera for his encouragement and fruitful collaboration. Warm thanks to Adriana for her understanding and also for reading drafts of this document. Finally, I want to thank Uni (the Etruscan goddess of the cosmos) for her condescension.
منابع مشابه
ATL with Strategy Contexts: Expressiveness and Model Checking
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary to plain ATL and ATL where strategy quantifiers reset previously selected strategies. We illustrate the important expressive power of strategy contexts by proving that they make the extended logics, namely ATLsc and A...
متن کاملReal-time and Probabilistic Temporal Logics: An Overview
Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have been introduced for the formal specification of real-time and complex systems, an up to date comprehensive analysis of these logics does not exist in the lit...
متن کاملQuantified CTL: expressiveness and model checking
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملQuantified CTL : expressiveness and model checking ( Extended abstract ) Arnaud
While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...
متن کاملA Hierarchy for Accellera's Property Specification Language
Vorliegende Diplomarbeit wurde von mir selbstständig verfasst. Es wurden keine anderen als die angegebenen Quellen und Hilfsmittel benutzt. 6 Conclusion and Future Work 55 ii 1 Introduction 1.1 Motivation Model checking and equivalence checking are state-of-the-art in modern hardware circuit design. Moreover, standardised languages like the hardware description languages VHDL [4, 56] and Verilo...
متن کاملCombining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL and XPath navigation, and between the μ-calculus and navigation based on regular expressions. This opened up the possibility of bringing model-checking techniques into the field of XML, as documents are naturally represented as labeled transition systems. Most k...
متن کامل